Strictly convex spheres in V-spaces
نویسندگان
چکیده
منابع مشابه
Strictly positive definite functions on spheres in Euclidean spaces
In this paper we study strictly positive definite functions on the unit sphere of the m-dimensional Euclidean space. Such functions can be used for solving a scattered data interpolation problem on spheres. Since positive definite functions on the sphere were already characterized by Schoenberg some fifty years ago, the issue here is to determine what kind of positive definite functions are act...
متن کاملWeighted composition operators between growth spaces on circular and strictly convex domain
Let $Omega_X$ be a bounded, circular and strictly convex domain of a Banach space $X$ and $mathcal{H}(Omega_X)$ denote the space of all holomorphic functions defined on $Omega_X$. The growth space $mathcal{A}^omega(Omega_X)$ is the space of all $finmathcal{H}(Omega_X)$ for which $$|f(x)|leqslant C omega(r_{Omega_X}(x)),quad xin Omega_X,$$ for some constant $C>0$, whenever $r_{Omega_X}$ is the M...
متن کاملDynamics of non-expansive maps on strictly convex Banach spaces
This paper concerns the dynamics of non-expansive maps on strictly convex finite dimensional normed spaces. By using results of Edelstein and Lyubich, we show that if X = (R, ‖ · ‖) is strictly convex and X has no 1-complemented Euclidean plane, then every bounded orbit of a non-expansive map f : X → X , converges to a periodic orbit. By putting extra assumptions on the derivatives of the norm,...
متن کاملStrictly Convex Corners Scatter
We prove the absence of non-scattering energies for potentials in the plane having a corner of angle smaller than π. This extends the earlier result of Bl̊asten, Päivärinta and Sylvester who considered rectangular corners. In three dimensions, we prove a similar result for any potential with a circular conic corner whose opening angle is outside a countable subset of (0, π).
متن کاملMinimum Strictly Convex Quadrangulations of Convex
We present a linear{time algorithm that decomposes a convex polygon conformally into a minimum number of strictly convex quadrilaterals. Moreover, we characterize the polygons that can be decomposed without additional vertices inside the polygon, and we present a linear{time algorithm for such decompositions, too. As an application , we consider the problem of constructing a minimum conformal r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 1983
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm-117-2-108-115